Any ST expression that results in a boolean result can be used to describe a transition condition


Any ST expression that results in a boolean result can be used to describe a transition condition
Общая лексика: Любое выражение на языке ST, которое приводит к бу (см. Robert W. Lewis: Programming industrial control systems using IEC 1131-3)

Универсальный англо-русский словарь. . 2011.

Смотреть что такое "Any ST expression that results in a boolean result can be used to describe a transition condition" в других словарях:

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Process-data diagram — A process data diagram is a diagram that describes processes and data that act as output of these processes. On the left side the meta process model can be viewed and on the right side the meta concept model can be viewed. A process data diagram… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.